Dynamics of RIB Usage at An Edge Router

نویسندگان

  • Kaustubh Gadkari
  • Steve DiBenedetto
  • Dan Massey
  • Christos Papadopoulos
چکیده

Previous studies [2], [4], [7], [8] have shown there is a small set of popular prefixes. These prefixes carry a high volume of traffic, experience few BGP route changes, and have other desirable characteristics. However, these popular prefixes constitute only a tiny fraction of the BGP routing table and the behavior of the remaining prefixes has received considerably less attention. For example, do the other prefixes oscillate between temporarily popular and then inactive? If one considers the top X prefixes ranked by traffic volume, will the set be fixed or vary wildly? The answers to these questions have important implications for route scalability and prefix aggregation, determine whether proposed prefix caching and/or FIB caching techniques would be deployable, and could help guide BGP design changes as well as future routing protocol designs. According to a recent IAB report [5], Internet routing, specifically the FIB (Forwarding Information Base), faces scalability issues due to the ever expanding size of the global routing table. This size increase is fueled, in part, by the injection of prefixes into the routing table due to multihoming and the need for traffic engineering. Large FIBs affect lookup speed and the price of routers, which now become more expensive due to the need for increased memory. Moreover, this increase threatens to push existing routers over their current limits, pushing ISPs into forced upgrades. These large tables consist of both the popular prefixes whose characteristics have been studied and the vast set of other prefixes for which much less is known. Several approaches have been suggested to overcome the routing scalability problem [1], [3]. Many of these approaches call for routers to route packets while storing less than the full FIB. With reduced FIBs it is important to carefully choose the prefixes that are stored in the routers FIB. Approaches such as LISP [3], Map-n-encap, Viaggre [1] aim to solve the scalability problem by storing reduced FIBs at the routers. This works well for the small set of popular prefixes, but are those prefixes sufficient? Choosing the appropriate prefixes to store at the routers requires an in-depth, fine-grained understanding of the prefix behavior. In this work, we study the dynamics of prefix usage on provider links between a regional ISP and two tier-1 ISPs. Using packet captures from a regional ISP, we associate packets with the BGP prefix used to forward them. We define a new metric, the mean rank difference, to capture how busy a prefix is. With this metric, we look at how a prefix maintains its rank throughout the day. As expected, the most dominant (popular) prefixes during the day tend to maintain their rank but the real objective is better understand the majority of prefixes, not just the most popular ones.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamics of Prefix Usage at an Edge Router

We investigate prefix activity on peering links between a regional Internet aggregation point and two tier-1 ISPs by analyzing a 24 hour packet trace from our regional ISP. Our data shows that a small number of prefixes carry the bulk of the packets, which corroborates previous work. However, unlike previous work, which focused on traffic from backbone routers, we look at edge traffic. In addit...

متن کامل

Distributed File Systems Implementation on an Edge Router using GlusterFS for Cloud Applications

A distributed file system (DFS) is a client/server-based application that allows clients to access and process data stored on the server as if it were on their own computer. An edge router has series of data cards, to handle data inflow and outflow which can be of the form of email headers, data packets, etc. Each of these data cards have their own file system architecture. This paper implement...

متن کامل

What do parrots and BGP routers have in common?

The Border Gateway Protocol propagates routing information accross the Internet in an incremental manner. It only advertises to its peers changes in routing. However, as early as 1998, observations have been made of BGP announcing the same route multiple times, causing router CPU load, memory usage and convergence time higher than expected. In this paper, by performing controlled experiments, w...

متن کامل

Enhancing Bandwidth Utilization and QoS in Optical Burst Switched High-Speed Network

In this paper, an efficient integrated novel scheme has been proposed that reduces the probability of burst contention by controlling the route at an edge router without contention resolution scheme at a core router. Also, this paper has been focused on the number of resources a packet uses in the network to lower the overall resource usage and loss probability. Simulation results indicate that...

متن کامل

End-to-End Contention Resolution Schemes for an Optical Packet Switching Network With Enhanced Edge Routers

This paper investigates contention resolution schemes for optical packet switching networks from an end-to-end perspective, where the combined exploitation of both core routers and edge routers are highlighted. For the optical-core network, we present the architecture of an optical router to achieve contention resolution in wavelength, time, and space domains. Complementing the solution involvi...

متن کامل

New Techniques for Regulating TCP Flow over Heterogeneous Networks

We study a typical network environment where TCP traac is generated from a source connected to a LAN (e.g. Ethernet) aggregated through an IP edge router to an access network (e.g. ATM, frame relay). Congestion at the edge router occurs when the bandwidth available in the access network cannot support the ag-gregated traac generated from the LAN. This paper presents a novel approach to reduce r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010